Working Paper Conngurations of Series-parallel Networks with Maximum Reliability Conngurations of Series-parallel Networks with Maximum Reliability Conngurations of Series-parallel Networks with Maximum Reliability

Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily represent those of the Institute or of its National Member Organizations. Reader aids: Purpose: Provide an algorithm for designing optimal network conngurations. Special math needed: Elementary probability, calculus. Special math needed to use results: Elementary arithmetics. Results useful to: System reliability analysts. Summary: The optimal design problem for networks with 3-state components is the following: select from a given class of networks with n components, each of which can be operative or experience an open-mode or a shorted-mode failure state, the network with maximum reliability. We present an algorithm for solving this problem in the case of 2-stage series-parallel networks, i. e., networks consisting of a number of series conngurations linked in parallel or vice versa. For practically relevant network sizes (up to 100 components), the algorithm is fast.